Online Traffic Smoothing for Delivery of VBR Media Streams
نویسندگان
چکیده
Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given an available client buffer, a window size and a window-sliding size, previous window-based online smoothing methods try to reduce peak bandwidth allocated in each window. However, as bandwidths allocated in different windows are minimized independently, these methods require a large peak bandwidth for transmitting entire stream. In this paper, a new window-based method is proposed. It introduces two new ideas, the dynamic window-sliding size and the aggressive work-ahead, for delivery of online VBR media streams. Our ADWS (aggressive and dynamic window-sliding) method can automatically decide the suitable window-sliding sizes for different windows. Thus, the allocated peak bandwidth can be further reduced. By examining various media streams, ADWS is shown to be effective and efficient. Considering the online transmission of movie Star Wars with a 90 KB client buffer, ADWS yields 13% less in peak bandwidth, compared with the best-known window-based online smoothing algorithm SLWIN(1). Its computation cost (the window-sliding number) is 75% of that required by SLWIN(1). * This work was partially supported by NSC under grants NSC88-2213-E-001-011, NSC88-2213-E-001-012, and NSC88-2213-E-001-025. A primitive version of this work appeared in IEEE INFOCOM'99, NY, U.S.A.
منابع مشابه
Traffic-Smoothing for Delivery of Online VBR Media Streams by a Dynamic Window-Based Approach
Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given the available client buffer and the sliding smooth window, conventional approaches try to minimize bandwidth allocated in each window. However, they can not lead to the minimization of bandwidth allocated for transmitting the entire stream. Although a sliding-w...
متن کاملAn Effective and Efficient Traffic Smoothing Scheme for Delivery of Online VBR Media Streams
Traffic smoothing for delivery of online VBR media streams is one of the most important problems in designing multimedia systems. Given available client buffer and a window-sliding size, conventional approaches try to reduce bandwidth allocated in each window. However, they can not lead to the minimization of bandwidth allocated for transmitting entire stream. Although a window-sliding approach...
متن کاملDynamic Window-Based Traffic-Smoothing for Optimal Delivery of Online VBR Media Streams
Traffic-smoothing for delivery of online VBR media is one of the most important problems in designing streaming multimedia applications. Given the available client buffer b and playback delay D, [21] introduces a window-based approach called SLWIN(k) to smooth online generated traffic for the pre-specified window size W (W<D) and sliding distance k (kSW). The required time complexity is O(n*W/k...
متن کاملBandwidth Allocation and Analysis of VBR MPEG Video Bit Streams
This paper presents the benefits and challenges in the encoding and delivery of variable bitrate (VBR) MPEG video. The network resources required to transmit stored variable rate MPEG can be reduced by properly analyzing and smoothing the video stream before transmission. A scheduling technique is presented which selects a traffic contract for a pre-encoded MPEG video stream with the criteria o...
متن کاملOnline variable-bit-rate video traffic smoothing
The efficient transmission of variable-bit-rate (VBR) video streams is complicated by the burstiness that video compression standards such as MPEG introduce. Most of the existing techniques concentrate on stored video traffic smoothing or real-time video traffic smoothing. However, there is a growing number of live video applications, such as video-casts of courses or television news, where man...
متن کامل